Iterative Message Passing Techniques for Rapid Code Acquisition
نویسندگان
چکیده
CHIEVING and maintaining code synchronization between the transmitter and the receiver is critical to all spread spectrum systems hecause even a small ,,,isalignment can cause serious signal-to-noise ratio (SNR) degradation. VPically, this task is performed in two steps: code acquisition and trackng. Our focus here is to apply iterative meS. sage passing algorithms (MPAs), generalizations of the fa(a1
منابع مشابه
A Low Complexity Circuit Architecture for Rapid PN Code Acquisition in UWB Systems Using Iterative Message Passing on Redundant Graphical Models
Rapidly acquiring the code phase of the spreading sequence in an ultra-wideband system is a very difficult problem. In this paper, we present a new iterative algorithm and its hardware architecture in detail. Our algorithm is based on running iterative message passing algorithms on a standard graphical model augmented with multiple redundant models. Simulation results show that our new algorith...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملINSTITUTE “ Synchronization in Low Duty Cycle UWB Systems Using Iterative
Iterative message passing algorithms (MPAs) on graphs, which are generalized from the well-known turbo decoding algorithm, have been studied intensively in recent years because they can provide near optimal performance and significant complexity reduction. The goal of the first part of this work is to apply message passing techniques to the pseudo random code acquisition problems. To do that, g...
متن کاملGraph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords...
متن کاملIterative encoding of low-density parity-check codes
Motivated by the potential to reuse the decoder architecture, and thus reduce circuit space, we explore the use of iterative encoding techniques which are based upon the graphical representation of the code. We design codes by identifying associated encoder convergence constraints and also eliminating some well known undesirable properties for sum-product decoding such as 4-cycles. In particula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003